منابع مشابه
Slight improvements of the Singleton bound
The problem of determining Aq(n, d), the maximum cardinality of a q-ary code of length n with minimum distance at least d, is considered in some cases where corresponding MDS codes do not exist. Slight improvements of the Singleton bound are given, including Aq(q + 2, q) q3 − 3 if q is odd, A5(7, 5) 53 − 4 and A16(18, 15) 184 − 4. © 2004 Elsevier B.V. All rights reserved.
متن کاملA Singleton Bound for Lattice Schemes
The binary coding theory and subspace codes for random network coding exhibit similar structures. The method used to obtain a Singleton bound for subspace codes mimic the technique used in obtaining the Singleton bound for binary codes. This motivates the question of whether there is an abstract framework that captures these similarities. As a first step towards answering this question, we use ...
متن کاملOn subsystem codes beating the quantum Hamming or Singleton bound
Subsystem codes are a generalization of noiseless subsystems, decoherence-free subspaces and stabilizer codes. We generalize the quantum Singleton bound to Fq-linear subsystem codes. It follows that no subsystem code over a prime field can beat the quantum Singleton bound. On the other hand, we show the remarkable fact that there exist impure subsystem codes beating the quantum Hamming bound. A...
متن کاملLocally Correctable and Testable Codes Approaching the Singleton Bound
Locally-correctable codes (LCCs) and locally-testable codes (LTCs) are codes that admit local algorithms for decoding and testing respectively. The local algorithms are randomized algorithms that make only a small number of queries to their input. LCCs and LTCs are both interesting in their own right, and have important applications in complexity theory. It is a well-known question what are the...
متن کاملElias Upper Bound for Euclidean Space Codes and Codes Close to the Singleton Bound
A typical communication system consists of a channel code to transmit signals reliably over a noisy channel. In general the channel code is a set of codewords which are used to carry information over the channel. This thesis deals with Elias upper bound on the normalized rate for Euclidean space codes and on codes which are close to the generalized Singleton bound, like MaximumDistance Separabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.06.001